Successive Refinement on Trees: A Special Case of a New MD Coding Region
نویسندگان
چکیده
New achievability results for the L-stage successive refinement problem with L > 2 are presented. These are derived from a recent achievability result for the more general problem of multiple description coding with L > 2 channels. It is shown that successive refinability on chains implies successive refinability on trees and that memoryless Gaussian sources are successively refinable on chains and trees.
منابع مشابه
A Random Variable Substitution Lemma With Applications to Multiple Description Coding
We establish a random variable substitution lemma and use it to investigate the role of refinement layer in multiple description coding, which clarifies the relationship among several existing achievable multiple description rate-distortion regions. Specifically, it is shown that the El Gamal-Cover (EGC) region is equivalent to the EGC* region (an antecedent version of the EGC region) while the...
متن کاملAdditive successive refinement
Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, inmost practical applications (e.g., speech coding) “ad...
متن کاملSuccessive Wyner-Ziv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem
We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinem...
متن کاملVector Set Partitioning with Classified Successive Refinement Vq for Embedded Wavelet Image Coding*
Set Partitioning in Hierarchical Trees (SPIHT), proposed by Said and Pearlman [1], is generally regarded as a very efficient wavelet-based still image compression scheme. The algorithm uses an efficient, joint scanning and bit-allocation mechanism for quantizing the scalar wavelet coefficients, and produces a perfectly embedded bitstream. This work extends set partitioning to scan vectors of wa...
متن کاملVector set partitioning with classified successive refinement VQ for embedded wavelet image and video coding
The Set Partitioning in Hierarchical Trees (SPIHT) approach for still image compression proposed by Said and Pearlman [8], is one of the most efficient embedded gray image compression schemes till date. The algorithm relies on a very efficient scanning cum bit-allocation scheme for quantizing the coefficients obtained by a wavelet decomposition of an image. In this paper, we adopt this scheme t...
متن کامل